Constructions and bounds for mixed-dimension subspace codes
نویسندگان
چکیده
منابع مشابه
Constructions and bounds for mixed-dimension subspace codes
Codes in finite projective spaces equipped with the subspace distance have been proposed for error control in random linear network coding. The resulting so-called Main Problem of Subspace Coding is to determine the maximum size Aq(v, d) of a code in PG(v−1,Fq) with minimum subspace distance d. Here we completely resolve this problem for d ≥ v − 1. For d = v − 2 we present some improved bounds ...
متن کاملIsotropic Constant Dimension Subspace Codes
In network code setting, a constant dimension code is a set of k-dimensional subspaces of F nq . If F_q n is a nondegenerated symlectic vector space with bilinear form f, an isotropic subspace U of F n q is a subspace that for all x, y ∈ U, f(x, y) = 0. We introduce isotropic subspace codes simply as a set of isotropic subspaces and show how the isotropic property use in decoding process, then...
متن کاملNew LMRD bounds for constant dimension codes and improved constructions
Let V ∼= Fq be a v-dimensional vector space over the finite field Fq with q elements. By [ V k ] we denote the set of all k-dimensional subspaces in V . Its size is given by the q-binomial coefficient [ v k ]q = ∏k−1 i=0 qv−qi qk−qi for 0 ≤ k ≤ v and 0 otherwise. The set of all subspaces of V forms a metric space associated with the so-called subspace distance dS(U,W ) = dim(U + W ) − dim(U ∩ W...
متن کاملSeparating Codes: Constructions and Bounds
Separating codes, initially introduced to test automaton, have revived lately in the study of fingerprinting codes, which are used for copyright protection. Separating codes play their role in making the fingerprinting scheme secure agains coalitions of pirates. We provide here better bounds, constructions and generalizations for these codes.
متن کاملBounds and Constructions for Multireceiver Authentication Codes
Multireceiver authentication codes allow one sender to construct an authenticated message for a group of receivers such that each receiver can verify authenticity of the received message. In this paper, we give a formal deenition of multireceiver authentication codes, derive information theoretic and combinatorial lower bounds on their performance and give new eecient constructions for such cod...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics of Communications
سال: 2016
ISSN: 1930-5346
DOI: 10.3934/amc.2016033